Coalescent experiments II: Markov bases of classical population genetic statistics
نویسندگان
چکیده
Evaluating the likelihood function of parameters in complex population genetic models from extant deoxyribonucleic acid (DNA) sequences is computationally prohibitive. In such cases, one may approximately infer the parameters from various summary statistics of the data. Such method are known as approximate likelihood/Bayesian computations. We employ computational commutative algebraic methods to obtain the exact likelihood of a large class of summary statistics that are linear combinations of the site frequency spectrum. keywords. integrating controlled coalescent measures via Markov bases; exactly approximate Bayesian/likelihood computation in population genetics
منابع مشابه
Coalescent experiments I: Unlabeled n-coalescent and the site frequency spectrum
We derive the transition structure of a Markovian lumping of Kingman’s n-coalescent [1, 2]. Lumping a Markov chain is meant in the sense of [3, def. 6.3.1]. The lumped Markov process, referred as the unlabeled n-coalescent, is a continuous-time Markov chain on the set of all integer partitions of the sample size n. We derive the backwardtransition, forward-transition, state-specific, and sequen...
متن کاملExperiments with the site frequency spectrum.
Evaluating the likelihood function of parameters in highly-structured population genetic models from extant deoxyribonucleic acid (DNA) sequences is computationally prohibitive. In such cases, one may approximately infer the parameters from summary statistics of the data such as the site-frequency-spectrum (SFS) or its linear combinations. Such methods are known as approximate likelihood or Bay...
متن کاملRunning Coalescent Analyses With coalescentMCMC
Coalescent analyses have emerged in the recent years as a powerful approach to investigate the demography of populations using genetic data. The coalescent is a random process describing the coalescent times of a genealogy with respect to population size and mutation rate. In the majority of cases, the genealogy of individuals within a population is unknown. So a coalescent analysis typically c...
متن کاملSequential Markov coalescent algorithms for population models with demographic structure.
We analyse sequential Markov coalescent algorithms for populations with demographic structure: for a bottleneck model, a population-divergence model, and for a two-island model with migration. The sequential Markov coalescent method is an approximation to the coalescent suggested by McVean and Cardin, and by Marjoram and Wall. Within this algorithm we compute, for two individuals randomly sampl...
متن کاملAn accurate sequentially Markov conditional sampling distribution for the coalescent with recombination.
The sequentially Markov coalescent is a simplified genealogical process that aims to capture the essential features of the full coalescent model with recombination, while being scalable in the number of loci. In this article, the sequentially Markov framework is applied to the conditional sampling distribution (CSD), which is at the core of many statistical tools for population genetic analyses...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009